The use of Hartley transform in OCR with application to printed Arabic character recognition
Identifieur interne : 000A64 ( Main/Exploration ); précédent : 000A63; suivant : 000A65The use of Hartley transform in OCR with application to printed Arabic character recognition
Auteurs : Sabri A. Mahmoud [Arabie saoudite] ; Ashraf S. Mahmoud [Arabie saoudite]Source :
- Pattern analysis and applications : (Print) [ 1433-7541 ] ; 2009.
Descripteurs français
- Pascal (Inist)
English descriptors
- KwdEn :
Abstract
Fast Hartley transform (FHT) is an integral transform which shares some features with the Fourier transform. Fourier transform is used successfully in computing the Fourier descriptors which are used in the recognition of characters and objects. In this paper, printed Arabic optical character recognition using Hartley transform is presented. The Hartley descriptors are estimated by applying the FHT to the Arabic printed characters. The contour of the Arabic character primary part is extracted and then FHT is applied to the extracted contours. Hartley features are extracted from the FHT domain. These features are used for the recognition of Arabic characters. It was experimentally proven that the use of 10-20 descriptors gives the best recognition rate. Hence, ten descriptors were used to save computation and processing times. Experimental results using ten Hartley descriptors resulted in a recognition rate of 97% and an error rate of 3%. Arabic characters' dots and holes were used in addition to the ten Hartley descriptors to enhance the recognition rate. The use of these features resulted in a 97.3 recognition rate, 2% rejection rate, and 0.7% error rate. The dot feature was also used to reduce the number of classes of the Arabic characters without affecting the recognition rate or the number of recognized characters. This technique, based on Hartley descriptors, was compared with the Fourier descriptors calculated from the fast Fourier transform (FFT) and with modified Fourier spectrum (MFS) descriptors. Experimental results have shown that the Hartley descriptors are comparable to the FFT-based Fourier descriptors in terms of recognition rate. The Hartley and FFT-based descriptors are better than the MFS descriptors in terms of recognition rate.
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: 000189
- to stream PascalFrancis, to step Curation: 000588
- to stream PascalFrancis, to step Checkpoint: 000179
- to stream Main, to step Merge: 000A73
- to stream Main, to step Curation: 000A64
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">The use of Hartley transform in OCR with application to printed Arabic character recognition</title><author><name sortKey="Mahmoud, Sabri A" sort="Mahmoud, Sabri A" uniqKey="Mahmoud S" first="Sabri A." last="Mahmoud">Sabri A. Mahmoud</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Department of Information and Computer Science, King Fahd University of Petroleum and Minerals, P.O. Box 1378</s1><s2>Dhahran 31261</s2><s3>SAU</s3><sZ>1 aut.</sZ></inist:fA14><country>Arabie saoudite</country><wicri:noRegion>Dhahran 31261</wicri:noRegion></affiliation></author><author><name sortKey="Mahmoud, Ashraf S" sort="Mahmoud, Ashraf S" uniqKey="Mahmoud A" first="Ashraf S." last="Mahmoud">Ashraf S. Mahmoud</name><affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Department of Computer Engineering, King Fahd University of Petroleum and Minerals, P.O. Box 1585</s1><s2>Dhahran 31261</s2><s3>SAU</s3><sZ>2 aut.</sZ></inist:fA14><country>Arabie saoudite</country><wicri:noRegion>Dhahran 31261</wicri:noRegion></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">10-0190623</idno><date when="2009">2009</date><idno type="stanalyst">PASCAL 10-0190623 INIST</idno><idno type="RBID">Pascal:10-0190623</idno><idno type="wicri:Area/PascalFrancis/Corpus">000189</idno><idno type="wicri:Area/PascalFrancis/Curation">000588</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000179</idno><idno type="wicri:doubleKey">1433-7541:2009:Mahmoud S:the:use:of</idno><idno type="wicri:Area/Main/Merge">000A73</idno><idno type="wicri:Area/Main/Curation">000A64</idno><idno type="wicri:Area/Main/Exploration">000A64</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">The use of Hartley transform in OCR with application to printed Arabic character recognition</title><author><name sortKey="Mahmoud, Sabri A" sort="Mahmoud, Sabri A" uniqKey="Mahmoud S" first="Sabri A." last="Mahmoud">Sabri A. Mahmoud</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Department of Information and Computer Science, King Fahd University of Petroleum and Minerals, P.O. Box 1378</s1><s2>Dhahran 31261</s2><s3>SAU</s3><sZ>1 aut.</sZ></inist:fA14><country>Arabie saoudite</country><wicri:noRegion>Dhahran 31261</wicri:noRegion></affiliation></author><author><name sortKey="Mahmoud, Ashraf S" sort="Mahmoud, Ashraf S" uniqKey="Mahmoud A" first="Ashraf S." last="Mahmoud">Ashraf S. Mahmoud</name><affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Department of Computer Engineering, King Fahd University of Petroleum and Minerals, P.O. Box 1585</s1><s2>Dhahran 31261</s2><s3>SAU</s3><sZ>2 aut.</sZ></inist:fA14><country>Arabie saoudite</country><wicri:noRegion>Dhahran 31261</wicri:noRegion></affiliation></author></analytic><series><title level="j" type="main">Pattern analysis and applications : (Print)</title><title level="j" type="abbreviated">Pattern anal. appl. : (Print)</title><idno type="ISSN">1433-7541</idno><imprint><date when="2009">2009</date></imprint></series></biblStruct></sourceDesc><seriesStmt><title level="j" type="main">Pattern analysis and applications : (Print)</title><title level="j" type="abbreviated">Pattern anal. appl. : (Print)</title><idno type="ISSN">1433-7541</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Arabic</term><term>Character recognition</term><term>Contourography</term><term>Fast Fourier transformation</term><term>Fourier transformation</term><term>Hartley transformation</term><term>Image processing</term><term>Optical character recognition</term><term>Pattern extraction</term><term>Pattern recognition</term><term>Printed character</term><term>Processing time</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Reconnaissance caractère</term><term>Reconnaissance optique caractère</term><term>Reconnaissance forme</term><term>Traitement image</term><term>Temps traitement</term><term>Transformation Hartley</term><term>Caractère imprimé</term><term>Arabe</term><term>Contourographie</term><term>Transformation Fourier</term><term>Extraction forme</term><term>Transformation Fourier rapide</term><term>.</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Fast Hartley transform (FHT) is an integral transform which shares some features with the Fourier transform. Fourier transform is used successfully in computing the Fourier descriptors which are used in the recognition of characters and objects. In this paper, printed Arabic optical character recognition using Hartley transform is presented. The Hartley descriptors are estimated by applying the FHT to the Arabic printed characters. The contour of the Arabic character primary part is extracted and then FHT is applied to the extracted contours. Hartley features are extracted from the FHT domain. These features are used for the recognition of Arabic characters. It was experimentally proven that the use of 10-20 descriptors gives the best recognition rate. Hence, ten descriptors were used to save computation and processing times. Experimental results using ten Hartley descriptors resulted in a recognition rate of 97% and an error rate of 3%. Arabic characters' dots and holes were used in addition to the ten Hartley descriptors to enhance the recognition rate. The use of these features resulted in a 97.3 recognition rate, 2% rejection rate, and 0.7% error rate. The dot feature was also used to reduce the number of classes of the Arabic characters without affecting the recognition rate or the number of recognized characters. This technique, based on Hartley descriptors, was compared with the Fourier descriptors calculated from the fast Fourier transform (FFT) and with modified Fourier spectrum (MFS) descriptors. Experimental results have shown that the Hartley descriptors are comparable to the FFT-based Fourier descriptors in terms of recognition rate. The Hartley and FFT-based descriptors are better than the MFS descriptors in terms of recognition rate.</div></front></TEI><affiliations><list><country><li>Arabie saoudite</li></country></list><tree><country name="Arabie saoudite"><noRegion><name sortKey="Mahmoud, Sabri A" sort="Mahmoud, Sabri A" uniqKey="Mahmoud S" first="Sabri A." last="Mahmoud">Sabri A. Mahmoud</name></noRegion><name sortKey="Mahmoud, Ashraf S" sort="Mahmoud, Ashraf S" uniqKey="Mahmoud A" first="Ashraf S." last="Mahmoud">Ashraf S. Mahmoud</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000A64 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000A64 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= OcrV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= Pascal:10-0190623
|texte= The use of Hartley transform in OCR with application to printed Arabic character recognition
}}
| This area was generated with Dilib version V0.6.32. |  |